Comparative Solutions of Exact and Approximate Methods for Traveling Salesman Problem

An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

The Traveling Salesman Problem: An overview of exact and approximate algorithms

In this paper, some of the main known algorithms for the traveling salesman problem are surveyed. The paper is organized as follows: 1) definition; 2) applications; 3) complexity analysis; 4) exact algorithms; 5) heuristic algorithms; 6) conclusion.

Provably good solutions for the traveling salesman problem

The determination of true optimum solutions of combinatorial optimization problems is seldomly required in practical applications. The majority of users of optimization software would be satis ed with solutions of guaranteed quality in the sense that it can be proven that the given solution is at most a few percent o an optimum solution. This paper presents a general framework for practical pro...

AN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM

Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...

The traveling salesman problem